Gröbner Basis Approach to Some Combinatorial Problems
نویسنده
چکیده
We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the Gröbner basis of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express different conditions in rather compact way.
منابع مشابه
Some meeting points of Gröbner bases and combinatorics
Let F be a field, V ⊆ Fn be a set of points, and denote by I(V ) the vanishing ideal of V in the polynomial ring F[x1, . . . , xn]. Several interesting algebraic and combinatorial problems can be formulated in terms of some finite V , and then Gröbner bases and standard monomials of I(V ) yield a powerful tool for solving them. We present the Lex Game method, which allows one to efficiently com...
متن کاملLinear Algebraic Approach to H-basis Computation
Macaulay introduced the notion of H-bases [2]. His original motivation was the transformation of systems of polynomial equations into simpler ones. The power of this concept was not really understood presumably because of the lack of facilities for symbolic computations. Later Buchberger invented Gröbner bases for computing multiplication tables for factor rings [1]. When Computer Algebra Syste...
متن کاملExtending Baker’s theorem
We summarize the combinatorial properties of congruence generation in congruence distributive varieties which are relevant to Baker’s finite basis theorem, explain the extent to which these properties survive in congruence meet-semidistributive varieties, indicate our approach to extending Baker’s theorem to the latter varieties, and pose several problems which our approach does not answer.
متن کاملPower of Monomial Ideals
1. Preliminaries 3 2. Gröbner Bases 3 2.1. Motivating Problems 3 2.2. Ordering of Monomials 3 2.3. The Division Algorithm in S = k[x1, . . . , xn] 5 2.4. Dickson’s Lemma 7 2.5. Gröbner Bases and the Hilbert Basis Theorem 10 2.6. Some Further Applications of Gröbner bases 18 3. Hilbert Functions 21 3.1. Macaulay’s Theorem 27 3.2. Hilbert Functions of Reduced Standard Graded k-algebras 37 3.3. Hi...
متن کاملAn algebraic approach to Integer Portfolio problems
Integer variables allow the treatment of some portfolio optimization problems in a more realistic way and introduce the possibility of adding some natural features to the model. We propose an algebraic approach to maximize the expected return under a given admissible level of risk measured by the covariance matrix. To reach an optimal portfolio it is an essential ingredient the computation of d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 20 شماره
صفحات -
تاریخ انتشار 2012